Sharp Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions
نویسندگان
چکیده
منابع مشابه
Sharp Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions
We prove tight and near-tight combinatorial complexity bounds for vertical decompositions of arrangements of hyperplanes and 3-simplices in four dimensions. In particular, we prove a tight upper bound of Θ(n) for the vertical decomposition of an arrangement of n hyperplanes in four dimensions, improving the best previously known bound [8] by a logarithmic factor. We also show that the complexit...
متن کاملOn Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions
We show that, for any collection H of n hyperplanes in < 4 , the combinato-rial complexity of the vertical decomposition of the arrangement A(H) of H is O(n 4 log n). The proof relies on properties of superimposed convex subdivisions of 3-space, and we also derive some other results concerning them.
متن کاملSharp bounds for decompositions of graphs into complete r-partite subgraphs
If G is a graph on n vertices and r 2 2, we let m,(G) denote the minimum number of complete multipartite subgraphs, with r or fewer parts, needed to partition the edge set, f(G). In determining m,(G), we may assume that no two vertices of G have the same neighbor set. For such reduced graphs G, w e prove that m,(G) 2 log,(n + r l)/r. Furthermore, for each k 2 0 and r 2 2, there is a unique redu...
متن کاملSharp Bounds on the PI Spectral Radius
In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.
متن کاملSharp bounds for harmonic numbers
In the paper, we collect some inequalities and establish a sharp double inequality for bounding the n-th harmonic number.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Computational Geometry
سال: 2004
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-003-2871-3